Logical Hierarchies in PTIME

Contrastive Morphological Typology and Logical Hierarchies

Two Logical Hierarchies of Optimization Problems over the Real Numbers

We introduce and study certain classes of optimization problems over the real numbers. The classes are defined by logical means, relying on metafinite model theory for so called R-structures (see [11], [10]). More precisely, based on a real analogue of Fagin’s theorem [11] we deal with two classes MAX-NPR and MIN-NPR of maximization and minimization problems, respectively, and figure out their ...

Politeness Orientation in Social Hierarchies in Urdu

The present research is aimed at investigating how the politeness of the speakers of Urdu is influenced by their relative social status in society. The researcher took politeness theory of Brown and Levinson (1978, 1987) as a model. To observe politeness of Urdu speakers, speech act of apology with different strategies was selected. A Discourse Completion Task (DCT) was used as an instrument to...

PTIME Queries Revisited

The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns out, two variants of this question have been formulated. Surprisingly, despite the importance of the problem, the relationship between these variants has not been systematically explored. A first contribution of the pr...

Unary Resolution: Characterizing Ptime

We give a characterization of deterministic polynomial time computation based on an algebraic structure called the resolution semiring (whose elements can be understood as logic programs or sets of rewriting rules over first-order terms), a construction stemming from an interactive interpretation of cut-elimination known as the geometry of interaction. More precisely, we restrict this framework...